Shelah-Stupp’s Iteration and Muchnik’s Iteration
نویسندگان
چکیده
منابع مشابه
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic
We investigate the relation between the theory of the iterations in the sense of Shelah-Stupp and of Muchnik, resp., and the theory of the base structure for several logics. These logics are obtained from the restriction of set quantification in monadic second order logic to certain subsets like, e.g., finite sets, chains, and finite unions of chains. We show that these theories of the Shelah-S...
متن کاملOn the Relationships Between Power Iteration, Inverse Iteration and FastICA
In recent years, there has been an increasing interest in developing new algorithms for digital signal processing by applying and generalising existing numerical linear algebra tools. A recent result shows that the FastICA algorithm, a popular state-of-the-art method for linear Independent Component Analysis (ICA), shares a nice interpretation as a Newton type method with the Rayleigh Quotient ...
متن کاملIteration Trees
large cardinal hypothesis used to prove I1~+1 determinacy in [MS] cannot be substantially improved. Our theorem is an application of the theory of core models or canonical inner models for large cardinal hypotheses. Our work develops further some of the basic ideas of this theory. The theory itself has many other applications, particularly in the realm of relative consistency results. (As a quo...
متن کاملAutomata Iteration
This paper considers the problem of computing the real convex hull of a finite set of ndimensional integer vectors. The starting point is a finite-automaton representation of the initial set of vectors. The proposed method consists in computing a sequence of automata representing approximations of the convex hull and using extrapolation techniques to compute the limit of this sequence. The conv...
متن کاملMunchausen Iteration
We present a method for solving polynomial equations over idempotent ω-continuous semirings. The idea is to iterate over the semiring of functions rather than the semiring of interest, and only evaluate when needed. The key operation is substitution. In the initial step, we compute a linear completion of the system of equations that exhaustively inserts the equations into one another. With func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2018
ISSN: 0169-2968,1875-8681
DOI: 10.3233/fi-2018-1667